Efficient computation of hashes
نویسندگان
چکیده
منابع مشابه
JIMU: Faster LEGO-Based Secure Computation Using Additive Homomorphic Hashes
LEGO-style cut-and-choose is known for its asymptotic efficiency in realizing actively-secure computations. The dominant cost of LEGO protocols is due to wire-soldering — the key technique enabling to put independently generated garbled gates together in a bucket to realize a logical gate. Existing wire-soldering constructions rely on homomorphic commitments and their security requires the majo...
متن کاملCayley Hashes: A Class of Efficient Graph-based Hash Functions
Hash functions are widely used in cryptography. Recent breakthroughs against the standard SHA-1 prompted NIST to launch a competition for a new secure hash algorithm, SHA-3 [1]. Provably secure hash functions, that is functions whose security reduces to a simply-stated, supposedly hard mathematical problem, are widely believed to be much too slow for the NIST competition. In this paper, we disc...
متن کاملEfficient Computation of PageRank
This paper discusses efficient techniques for computing PageRank, a ranking metric for hypertext documents. We show that PageRank can be computed for very large subgraphs of the web (up to hundreds of millions of nodes) on machines with limited main memory. Running-time measurements on various memory configurations are presented for PageRank computation over the 24-million-page Stanford WebBase...
متن کاملWhen Hashes Collide
attitude is dangerous: crypto provides the foundation for any real attempt at security or privacy. Without it, we couldn’t build truly secure solutions for the challenges of information confidentiality and integrity or individual user authentication and authorization; we also wouldn’t be able to deal with more complicated concepts such as signing digital documents or enabling nonrepudiation for...
متن کاملComputation-Efficient Parallel Prefix
We are interested in solving the prefix problem of n inputs using p < n processors on completely connected distributed-memory multicomputers (CCDMMs). This paper improves a previous work in three respects. First, the communication time of the previous algorithm is reduced significantly. Second, we show that p(p + 1)/2 < n is required for the new algorithm and the original one to be applicable. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2014
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/513/3/032042